Algebra-coalgebra duality in brzozowski's minimization algorithm
نویسندگان
چکیده
منابع مشابه
A Algebra-Coalgebra Duality in Brzozowski’s Minimization Algorithm
We give a new presentation of Brzozowski’s algorithm to minimize finite automata, using elementary facts from universal algebra and coalgebra, and building on earlier work by Arbib and Manes on a categorical presentation of Kalman duality between reachability and observability. This leads to a simple proof of its correctness and opens the door to further generalizations. Notably, we derive algo...
متن کاملAlgebra, Coalgebra, and Minimization in Polynomial Differential Equations
We consider reasoning and minimization in systems of polynomial ordinary differential equations (odes). The ring of multivariate polynomials is employed as a syntax for denoting system behaviours. We endow polynomials with a transition system structure based on the concept of Lie derivative, thus inducing a notion ofL-bisimulation. Two states (variables) are provenL-bisimilar if and only if the...
متن کاملCoalgebra-to-Algebra Morphisms
Given a coalgebra p for HG, an algebra s for GH and the obvious notion of morphism from coalgebra to algebra, we observe that morphisms from Gp to s correspond to morphisms from p to Hs in the manner of an adjunction even when there is no adjunction between G and H. This appears to be one of the basic phenomena underlying the transport of special algebras. A proof of Freyd’s Iterated Square The...
متن کاملInitial Algebra and Final Coalgebra Semantics
The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial semantics from final semantics, using the initiality and finality to ensure their equality. Moreo...
متن کاملScientific Modelling with Coalgebra-Algebra Homomorphisms
Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications in recursive functional programming, several basic modes of reasoning about scientific models have been demonstrated to admit such an exact meta-theory. Here...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2014
ISSN: 1529-3785,1557-945X
DOI: 10.1145/2490818